Effective Derivation of Similarity Transformations for Implicit Laplacian Mesh Editing

نویسندگان

  • Hongbo Fu
  • Oscar Kin-Chung Au
  • Chiew-Lan Tai
چکیده

Laplacian coordinates as a local shape descriptor have been employed in mesh editing. As they are encoded in the global coordinate system, they need to be transformed locally to reflect the changed local features of the deformed surface. We present a novel implicit Laplacian editing framework which is linear and effectively captures local rotation information during editing. Directly representing rotation with respect to vertex positions in 3D space leads to a nonlinear system. Instead, we first compute the affine transformations implicitly defined for all the Laplacian coordinates by solving a large sparse linear system, and then extract the rotation and uniform scaling information from each solved affine transformation. Unlike existing differential-based mesh editing techniques, our method produces visually pleasing deformation results under large angle rotations or big-scale translations of handles. Additionally, to demonstrate the advantage of our editing framework, we introduce a new intuitive editing technique, called configuration-independent merging, which produces the same merging result independent of the relative position, orientation, scale of input meshes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Mesh Editing, Manifold Learning, and Diffusion Wavelets

We spell out a formal equivalence between the naive Laplacian editing and semi-supervised learning by bi-Laplacian Regularized Least Squares. This allows us to write the solution to Laplacian mesh editing in a closed form, based on which we introduce the Generalized Linear Editing (GLE). GLE has both naive Laplacian editing and gradient based editing as special cases. GLE allows using diffusion...

متن کامل

Polygonal mesh watermarking using Laplacian coordinates

We propose a watermarking algorithm for polygonal meshes based on the modification of the Laplacian coordinates. More specifically, we first compute the Laplacian coordinates (x,y,z) of the mesh vertices, then construct the histogram of the lengths of the (x,y,z) vectors, and finally, insert the watermark by altering the shape of that histogram. The watermark extraction is carried out blindly, ...

متن کامل

Robust mesh editing using Laplacian coordinates

Shape deformation and editing are important for animation and game design. Laplacian surface basedmethods have beenwidely investigated and used inmanyworks. In this paperwe propose a robustmesh editing frameworkwhich improves traditional Laplacian surface editing. It consists of two procedures: skeleton based as-rigid-as-possible (ARAP) shape modeling and detail-preservingmesh optimization. Tra...

متن کامل

A discrete 3D+t Laplacian framework for mesh animation processing

In this report we extend the discrete 3D Laplacian framework to mesh animations, represented as temporally coherent sequences of meshes. In order to let the user control the motion in uence with respect to the geometry, we introduce a parameter for the time dimension. Our discrete 3D+t Laplace operator holds the same properties as the discrete 3D Laplacian, as soon as this parameter is non nega...

متن کامل

Spectral Surface Deformation with Dual Mesh

In this paper, we introduce a new surface deformation algorithm by combining the spectral method with the dual Laplacian editing algorithm. The dual Laplacian editing algorithm tries to maintain the Laplacian coordinates of all the vertices before and after deformation in dual space as much as possible. By using an iteration process, the local rotational effects can be achieved to get very natu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2007